package leetcode.weekly.week320;

import java.util.Iterator;

//Solution1Test
public class Solution1 {

	public int unequalTriplets(int[] nums) {
		int ans = 0;
		for (int i = 0; i < nums.length; i++) {
			for (int j = i + 1; j < nums.length; j++) {
				for (int k = j + 1; k < nums.length; k++) {
					if (nums[i] != nums[j] && nums[i] != nums[k] && nums[j] != nums[k]) {
						ans += 1;
					}
				}
			}
		}
		return ans;
	}

}
